Proof-nets as Logical Forms for LFG
نویسنده
چکیده
Although ‘glue semantics’ appears to be generally accepted as LFG’s present account of semantic composition, its uptake amongst LFG practitioners doesn’t actually seem to be that extensive (and a number of well-known syntacticians have claimed to me that they are pretty much baffled by it). A possible reason for this is that the standard presentation of glue is based on term-assigning deductions in linear logic, a kind of apparatus that isn’t very congruent with normal LFG mechanisms. Here I will show how proof-nets, an alternative format for deductions in certain forms of linear logic, can be construed as a linguistic level of ‘logical forms’, related to the other levels in LFG by correspondence relations in a manner reminiscent of the c-structure-f-structure correspondence φ, as discussed for example in Kaplan (1995). Perhaps presenting glue in a manner more characteristic of linguistics in general and LFG in particular will make it easier to grasp, especially for LFG syntacticians.
منابع مشابه
Intuitionistic Multiplicative Proof Nets as Models of Directed Acyclic Graph Descriptions
Given an intuitionistic proof net of linear logic, we abstract an order between its atomic formulas. From this order, we represent intuitionistic multiplicative proof nets in the more compact form of models of directed acyclic graph descriptions. If we restrict the logical framework to the implicative fragment of intuitionistic linear logic, we show that proof nets reduce to models of tree desc...
متن کاملYet Another Correctness Criterion for Multiplicative Linear Logic with MIX
A new correctness criterion for discriminating Proof Nets among Proof Structures of Multiplicative Linear Logic with MIX rule is provided. This criterion is inspired by an original interpretation of Proof Structures as distributed systems, and logical formulae as processes. The computation inside a system corresponds to the logical ow of information inside a proof, that is, roughly, a distribut...
متن کاملProof equivalence in MLL is PSPACE-complete
MLL proof equivalence is the problem of deciding whether two proofs in multiplicative linear logic are related by a series of inference permutations. It is also known as the word problem for ∗-autonomous categories. Previous work has shown the problem to be equivalent to a rewiring problem on proof nets, which are not canonical for full MLL due to the presence of the two units. Drawing from rec...
متن کاملClassical Logic = Fibred MLL
Syntactically, classical logic decomposes thus [Gir87]: Classical logic = MLL + Superposition where MLL is Multiplicative Linear Logic, and superposition means contraction (binary case) and weakening (nullary case). Proof nets for classical logic have been proposed [Gir91, Rob03], containing explicit contraction and weakening nodes. Just as the logical sequent rules of conjuction (tensor) and d...
متن کاملm at h . L O / 0 50 40 28 v 1 1 A pr 2 00 5 Classical logic = Fibred MLL
Syntactically, classical logic decomposes thus [Gir87]: Classical logic = MLL + Superposition where MLL is Multiplicative Linear Logic, and superposition means contraction (binary case) and weakening (nullary case). Proof nets for classical logic have been proposed [Gir91, Rob03], containing explicit contraction and weakening nodes. Just as the logical sequent rules of conjuction (tensor) and d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007